One-step multiderivative methods for first order ordinary differential equations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error Inhibiting Block One-step Schemes for Ordinary Differential Equations

The commonly used one step methods and linear multi-step methods all have a global error that is of the same order as the local truncation error. In fact, this is true of the entire class of general linear methods. In practice, this means that the order of the method is typically defined solely by order conditions which are derived by studying the local truncation error. In this work we investi...

متن کامل

Improved linear multi-step methods for stochastic ordinary differential equations

We consider linear multi-step methods for stochastic ordinary differential equations and study their convergence properties for problems with small noise or additive noise. We present schemes where the drift part is approximated by well-known methods for deterministic ordinary differential equations. Previously, we considered Maruyama-type schemes, where only the increments of the driving Wiene...

متن کامل

Order Ordinary Differential Equations

The DI methods for directly solving a system ofa general higher order ODEs are discussed. The convergence of the constant stepsize and constant order formulation of the DI methods is proven first before the convergencefor the variable order and stepsize case.

متن کامل

Discrete Galerkin and Related One - Step Methods for Ordinary Differential Equations

New techniques for numerically solving systems of first-order ordinary differential equations are obtained by finding local Galerkin approximations on each subinterval of a given mesh. Different classes of methods correspond to different quadrature rules used to evaluate the innerproducts involved. At each step, a polynomial of degree/; is constructed and the arcs are joined together continuous...

متن کامل

The Order of Numerical Methods for Ordinary Differential Equations

For a general class of methods, which includes linear multistep and RungeKutta methods as special cases, a concept of order relative to a given starting procedure is defined and an order of convergence theorem is proved. The definition is given an algebraic interpretation and illustrated by the derivation of a particular fourth-order method.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BIT

سال: 1981

ISSN: 0006-3835,1572-9125

DOI: 10.1007/bf01932848